Chinese translation for "transitive graph"
|
- 可迁图, 传递图
Related Translations:
transitive: adj.传递的，可转移的；【语法】及物的；【物理学】过渡的。n.及物动词 (opp. intransitive)。adv.-ly ,-ness n.
- Example Sentences:
| 1. | On restricted edge - connectivity of vertex - transitive graphs
点可迁图的限制边连通度 | | 2. | In addition , we get some 1 - arc - transitive graphs
此外，我们还得到了一些1 -弧传递图。 | | 3. | Classification of primitive - arc transitive graphs
弧传递图的分类 | | 4. | In this paper , weakly arc - transitive graphs are studied
本文研究的是弱弧传递图的性质和结构。 | | 5. | A regular and edge - transitive graph which is not vertex - transitive is said to be semisymmetric
半对称图是指正则，边传递，但点不传递的图。 | | 6. | Many results on undirected vertex - transitive graphs are applied on directed cases in parallel . and some different conclusions from undirected case are obtained . it is proved that the above two conjectures hold for vertex - digraphs
我们将许多无向点可迁图的结果平行地推广到有向点可迁图中，同时得到了一些不同与无向图情形的结论。 | | 7. | In the last chapter , we use the results of higher order edge connectivity to study the tree decomposition of transitive graphs , deriving a sufficient condition for a graph to have tree number equivalent to the arboricity
在最后一章中，我们使用高阶边连通度的结果研究对称图中树分解的一个问题，给出了森林数等于树数的一个充分条件。 | | 8. | In the first chapter , the background and some basic results are introduced . in the second chapter , we study higher order edge connectivity , and obtained ( a ) except for three graphs , all infinite circulants with finite jump sequence are super - ; ( b ) except for three classes of graphs , all edge transitive graphs are optimally - ( 3 ) ; ( c ) the optimally - ( 3 ) property is characterized for vertex transitive graphs , in particular , necessary and sufficient conditions are give for cayley graphs to be optimally - ( 3 ) ( d ) a sufficient condition for a graph to be optimally - ( 3 ) is given
第二章中，我们研究高阶边连通度，得到了如下结果： ( a )除了三个特殊图外，所有具有有限跃阶的无限循环图都是超边连通的； ( b )除了三种特殊图类外，所有边传递图都是最优- ~ ( 3 )图； ( c )刻划了点传递图的最优- ~ ( 3 )性，特别是给出了cayley图和极小cayley图为最优- ~ ( 3 )图的充分必要条件； ( d )给出了一个图(不一定是对称图)是最优- ~ ( 3 )图的一种充分条件。 | | 9. | In chapter three , we study graphs with higher order vertex connectedness and ( a ) a characterization of edge transitive graphs which are super - connected or hyper - connected is given ; ( b ) a new measure of network reliability , semi - hyper - connectedness , is proposed , and edge transitive graphs which are semi - hyper - connected are characterized
在第三章中，我们研究高阶点连通性，得到如下结果： ( a )刻划了边传递图的super -性和hyper -性； ( b )定义了一种新的网络可靠性度量标准： semi - hyper -性，并给出了边传递图为semi - hyper -图的充要条件。 |
- Similar Words：
- "transitive dependency" Chinese translation, "transitive digraph" Chinese translation, "transitive functional dependency" Chinese translation, "transitive fuzzy relation" Chinese translation, "transitive grammar" Chinese translation, "transitive group" Chinese translation, "transitive group of motions" Chinese translation, "transitive lattice" Chinese translation, "transitive law" Chinese translation, "transitive model" Chinese translation
|
|
|
